Behavior of O(log n) local commuting hamiltonians
نویسندگان
چکیده
We study the variant of the k-local hamiltonian problem which is a natural generalization of k-CSPs, in which the hamiltonian terms all commute. More specifically, we consider a hamiltonian H = ∑i Hi over n qubits, where each Hi acts non-trivially on O(log n) qubits and all the terms Hi commute, and show the following 1. We show that a specific case of O(log n) local commuting hamiltonians over the hypercube is in NP, using the Bravyi-Vyalyi Structure theorem from [7]. 2. We give a simple proof of a generalized area law for commuting hamiltonians (which seems to be a folklore result) in all dimensions, and deduce the case for O(log n) local commuting hamiltonians. 3. We show that traversing the ground space of O(log n) local commuting hamiltonians is QCMA complete. The first two behaviours seem to indicate that deciding whether the ground space energy of O(log n)-local commuting hamiltonians is low or high might be in NP, or possibly QCMA, though the last behaviour seems to indicate that it may indeed be the case that O(log n)-local commuting hamiltonians are QMA complete.
منابع مشابه
QCMA hardness of ground space connectivity for commuting Hamiltonians
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a polynomial length sequence of 2-qubit unitaries while remaining at all times in a state with low energy for a given Hamiltonian H. It was shown in [GS15] that this...
متن کاملStructures in Bc N Ruijsenaars-schneider Models
We construct the classical r-matrix structure for the Lax formulation of BC N Ruijsenaars-Schneider systems proposed in [18]. The r-matrix structure takes a quadratic form similar to the A N Ruijsenaars-Schneider Poisson bracket behavior, although the dy-namical dependence is more complicated. Commuting Hamiltonians stemming from the BC N Ruijsenaars-Schneider Lax matrix are shown to be linear ...
متن کاملThe complexity of estimating local physical quantities
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class P, and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P-complete. (Here, P is the set of decision problem...
متن کاملThe Complexity of Simulating Local Measurements on Quantum Systems
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class PQMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is PQMA[log]-complete. In this paper, we conti...
متن کاملComplexity of commuting Hamiltonians on a square lattice of qubits
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficien...
متن کامل